Simple Explanation of Big O Part II

So if you want to find a name in a phone book of a million names you can actually find any name by doing this at most 20 times. In comparing search algorithms we decide that this comparison is our 'n'. For a phone book of 3 names it takes 2 comparisons (at most).For 7 it takes at most 3.For 15 it takes 4....For 1,000,000 it takes 20. That is staggeringly good isn't it? In Big-O terms this is O(log n) or logarithmic complexity. Now the logarithm in question could be ln (base e), log10, l...

 The Earliest Account of Newton and the Apple

In the year 1666 he retired again from Cambridge... to his mother in Lincolnshire & whilst he was musing in a garden it came into his thought that the power of gravity (wch brought an apple from the tree to the ground) was not limited to a certain distance from the earth but that this power must extend much farther than was usually thought. Why not as high as the moon said he to himself & if so that must influence her motion & perhaps retain her in her orbit, whereupon he fell a c...